Pii: S0167-8396(02)00088-2
نویسندگان
چکیده
We begin by considering the problem of fitting a single Bézier curve segment to a set of ordered data so that the error is minimized in the total least squares sense. We develop an algorithm for applying the Gauss–Newton method to this problem with a direct method for evaluating the Jacobian based on implicitly differentiating a pseudo-inverse. We then demonstrate the simple extension of this algorithm to B-spline curves. We present some experimental results for both cases. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Total least squares fitting of Bézier and B-spline curves to ordered data
We begin by considering the problem of fitting a single Bézier curve segment to a set of ordered data so that the error is minimized in the total least squares sense. We develop an algorithm for applying the Gauss–Newton method to this problem with a direct method for evaluating the Jacobian based on implicitly differentiating a pseudo-inverse. We then demonstrate the simple extension of this a...
متن کاملPii: S0167-8396(02)00164-4
We study the relationship of transformations between Legendre and Bernstein basis. Using the relationship, we present a simple and efficient method for optimal multiple degree reductions of Bézier curves with respect to the L2-norm. 2002 Elsevier Science B.V. All rights reserved.
متن کاملPii: S0167-8396(02)00090-0
This paper gives an algorithm for computing proper polynomial parametrizations for a particular class of curves. This class is characterized by the existence of a polynomial parametrization and by the absence of affine singularities. The algorithm requires O(n3 logn) field operations, where n is the degree of the curve. 2002 Elsevier Science B.V. All rights reserved.
متن کاملOptimal slicing of free-form surfaces
Many applications, such as contour machining, rapid prototyping, and reverse engineering by laser scanner or coordinate measuring machine, involve sampling of free-from surfaces along section cuts by a family of parallel planes with equidistant spacing ∆ and common normal N. To ensure that such planar sections provide faithful descriptions of the shape of a surface, it is desirable to choose th...
متن کاملRefinement operators for triangle meshes
Refinement operators for triangular meshes as used in subdivision schemes or remeshing are discussed. A numbering scheme is presented, covering all refinement operators that (topologically) map vertices onto vertices. Using this characterization, some special properties of n-adic and √ 3-subdivision are easy to see.
متن کامل